Adaptive Message Ferry Route (aMFR) for Partitioned MANETs

Message ferrying (MF) scheme is a scheme to restore a Mobile Ad Hoc Network (MANET) from partitioning. Despite of effectiveness, it suffers from long delay caused by the poor design of ferry route. The Message Ferry Route (MFR) problem has been studied to minimize this drawback of MF schemes. In this paper, we argue that an adaptive way of constructing the ferry route would be more practical and effective. We thus define the Adaptive MFR (aMFR) problem with more general and realistic assumptions, and propose a new scheme for adaptive message ferrying. The proposed scheme adopts the Shortest Process Time First (SPTF) rule for the Job Sequencing Problem (JSP), to construct ferry routes and is referred to as AMFeR. From simulations, we show that AMFeR can shorten the average message delay. With its simplicity and distributed nature, AMFeR is a suitable solution for partition restoration of MANETs.